On the Possibility of Non-Interactive E-Voting in the Public-key Setting
Identifieur interne : 000195 ( Main/Exploration ); précédent : 000194; suivant : 000196On the Possibility of Non-Interactive E-Voting in the Public-key Setting
Auteurs : Rosario Giustolisi [Suède] ; Vincenzo Iovino [Luxembourg (pays)] ; Peter R Nne [France]Source :
English descriptors
Abstract
In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key setting (NIVS) in which the voters, after having published their public-keys, can use the corresponding secret-keys to participate in an arbitrary number of one-round elections. We first construct a NIVS with a standard tally function where the number of votes for each candidate is counted. Further, we present constructions for two alternative types of elections. Specifically in the first type (dead or alive elections) the tally shows if at least one voter cast a vote for the candidate. In the second one (elections by unanimity), the tally shows if all voters cast a vote for the candidate. Our constructions are based on bilinear groups of prime order. As definitional contribution we provide formal computational definitions for privacy and verifiability of NIVSs. We conclude by showing intriguing relations between our results, secure computation, electronic exams and conference management systems.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 003789
- to stream Hal, to step Curation: 003789
- to stream Hal, to step Checkpoint: 000166
- to stream Main, to step Merge: 000195
- to stream Main, to step Curation: 000195
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the Possibility of Non-Interactive E-Voting in the Public-key Setting</title><author><name sortKey="Giustolisi, Rosario" sort="Giustolisi, Rosario" uniqKey="Giustolisi R" first="Rosario" last="Giustolisi">Rosario Giustolisi</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-443457" status="VALID"><orgName>Swedish ICT</orgName><orgName type="acronym">SICS</orgName><desc><address><addrLine>Box 1151164 26 Kista</addrLine><country key="SE"></country></address><ref type="url">https://www.swedishict.se/</ref></desc></hal:affiliation><country>Suède</country></affiliation></author><author><name sortKey="Iovino, Vincenzo" sort="Iovino, Vincenzo" uniqKey="Iovino V" first="Vincenzo" last="Iovino">Vincenzo Iovino</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-366875" status="VALID"><orgName>University of Luxembourg [Luxembourg]</orgName><desc><address><addrLine>Campus Kirchberg6, rue Richard Coudenhove-KalergiL-1359 Luxembourg</addrLine><country key="LU"></country></address><ref type="url">http://wwwfr.uni.lu/</ref></desc></hal:affiliation><country>Luxembourg (pays)</country></affiliation></author><author><name sortKey="R Nne, Peter" sort="R Nne, Peter" uniqKey="R Nne P" first="Peter" last="R Nne">Peter R Nne</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-445522" status="VALID"><idno type="RNSR">201622052E</idno><orgName>Proof techniques for security protocols</orgName><orgName type="acronym">PESTO</orgName><date type="start">2016-01-01</date><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/pesto</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-01242688</idno><idno type="halId">hal-01242688</idno><idno type="halUri">https://hal.inria.fr/hal-01242688</idno><idno type="url">https://hal.inria.fr/hal-01242688</idno><date when="2015-12-13">2015-12-13</date><idno type="wicri:Area/Hal/Corpus">003789</idno><idno type="wicri:Area/Hal/Curation">003789</idno><idno type="wicri:Area/Hal/Checkpoint">000166</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000166</idno><idno type="wicri:Area/Main/Merge">000195</idno><idno type="wicri:Area/Main/Curation">000195</idno><idno type="wicri:Area/Main/Exploration">000195</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">On the Possibility of Non-Interactive E-Voting in the Public-key Setting</title><author><name sortKey="Giustolisi, Rosario" sort="Giustolisi, Rosario" uniqKey="Giustolisi R" first="Rosario" last="Giustolisi">Rosario Giustolisi</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-443457" status="VALID"><orgName>Swedish ICT</orgName><orgName type="acronym">SICS</orgName><desc><address><addrLine>Box 1151164 26 Kista</addrLine><country key="SE"></country></address><ref type="url">https://www.swedishict.se/</ref></desc></hal:affiliation><country>Suède</country></affiliation></author><author><name sortKey="Iovino, Vincenzo" sort="Iovino, Vincenzo" uniqKey="Iovino V" first="Vincenzo" last="Iovino">Vincenzo Iovino</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-366875" status="VALID"><orgName>University of Luxembourg [Luxembourg]</orgName><desc><address><addrLine>Campus Kirchberg6, rue Richard Coudenhove-KalergiL-1359 Luxembourg</addrLine><country key="LU"></country></address><ref type="url">http://wwwfr.uni.lu/</ref></desc></hal:affiliation><country>Luxembourg (pays)</country></affiliation></author><author><name sortKey="R Nne, Peter" sort="R Nne, Peter" uniqKey="R Nne P" first="Peter" last="R Nne">Peter R Nne</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-445522" status="VALID"><idno type="RNSR">201622052E</idno><orgName>Proof techniques for security protocols</orgName><orgName type="acronym">PESTO</orgName><date type="start">2016-01-01</date><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/pesto</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>bilinear maps</term><term>confer-ence management systems</term><term>e-voting</term><term>electronic exams</term><term>secure computation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key setting (NIVS) in which the voters, after having published their public-keys, can use the corresponding secret-keys to participate in an arbitrary number of one-round elections. We first construct a NIVS with a standard tally function where the number of votes for each candidate is counted. Further, we present constructions for two alternative types of elections. Specifically in the first type (dead or alive elections) the tally shows if at least one voter cast a vote for the candidate. In the second one (elections by unanimity), the tally shows if all voters cast a vote for the candidate. Our constructions are based on bilinear groups of prime order. As definitional contribution we provide formal computational definitions for privacy and verifiability of NIVSs. We conclude by showing intriguing relations between our results, secure computation, electronic exams and conference management systems.</div></front></TEI><affiliations><list><country><li>France</li><li>Luxembourg (pays)</li><li>Suède</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Metz</li><li>Nancy</li></settlement><orgName><li>Université de Lorraine</li></orgName></list><tree><country name="Suède"><noRegion><name sortKey="Giustolisi, Rosario" sort="Giustolisi, Rosario" uniqKey="Giustolisi R" first="Rosario" last="Giustolisi">Rosario Giustolisi</name></noRegion></country><country name="Luxembourg (pays)"><noRegion><name sortKey="Iovino, Vincenzo" sort="Iovino, Vincenzo" uniqKey="Iovino V" first="Vincenzo" last="Iovino">Vincenzo Iovino</name></noRegion></country><country name="France"><region name="Grand Est"><name sortKey="R Nne, Peter" sort="R Nne, Peter" uniqKey="R Nne P" first="Peter" last="R Nne">Peter R Nne</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000195 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000195 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Hal:hal-01242688
|texte= On the Possibility of Non-Interactive E-Voting in the Public-key Setting
}}
| This area was generated with Dilib version V0.6.33. |  |